Unambiguous Automata
نویسندگان
چکیده
We give a new presentation of two results concerning synchronized automata. The first one gives a linear bound on the synchronization delay of complete local automata. The second one gives a cubic bound for the minimal length of a synchronizing pair in a complete synchronized unambiguous automaton. The proofs are based on results on unambiguous monoids of relations. Mathematics Subject Classification (2000). 68Q45;20M35;94A45;68R15.
منابع مشابه
Model Checking Markov Chains Against Unambiguous Buchi Automata
An automaton is unambiguous if each word has at most one accepting run and separated if no word is accepted from two distinct states. The classical translation of LTL formulas to Büchi automata [5] produces unambiguous separated automata since the states of such automata correspond to complete subformula types. Motivated by this observation, Couvreur et al. [3] present a polynomialtime algorith...
متن کاملForms of Determinism for Automata∗
We survey in this paper some variants of the notion of determinism, refining the spectrum between non-determinism and determinism. We present unambiguous automata, strongly unambiguous automata, prophetic automata, guidable automata, and history-deterministic automata. We instantiate these various notions for finite words, infinite words, finite trees, infinite trees, data languages, and cost f...
متن کاملMarkov Chains and Unambiguous Büchi Automata
Unambiguous automata, i.e., nondeterministic automata with the restriction of having at most one accepting run over a word, have the potential to be used instead of deterministic automata in settings where nondeterministic automata can not be applied in general. In this paper, we provide a polynomially time-bounded algorithm for probabilistic model checking of discrete-time Markov chains agains...
متن کاملA superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton
Unambiguous non-deterministic finite automata have intermediate expressive power and succinctness between deterministic and non-determi-
متن کاملSchloss Dagstuhl – Leibniz-Center for Informatics GmbH, Dagstuhl Publishing, Saarbrücken/Wadern,
We survey in this paper some variants of the notion of determinism, refining the spectrum betweennon-determinism and determinism. We present unambiguous automata, strongly unambiguousautomata, prophetic automata, guidable automata, and history-deterministic automata. Weinstantiate these various notions for finite words, infinite words, finite trees, infinite trees, datalanguages...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematics in Computer Science
دوره 1 شماره
صفحات -
تاریخ انتشار 2008